The complexity of Fibonacci-like kneading sequences

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Fibonacci-Like Sequences

In this note, we study Fibonacci-like sequences that are defined by the recurrence Sk = a, Sk+1 = b, Sn+2 ≡ Sn+1 + Sn (mod n + 2) for all n ≥ k, where k, a, b ∈ N, 0 ≤ a < k, 0 ≤ b < k + 1, and (a, b) 6= (0, 0). We will show that the number α = 0.SkSk+1Sk+2 · · · is irrational. We also propose a conjecture on the pattern of the sequence {Sn}n≥k.

متن کامل

Complexity of unimodal maps with aperiodic kneading sequences

It is well established that a formal language generated from a unimodal map is regular if and only if the map’s kneading sequence is either periodic or eventually periodic. A previously proposed conjecture said that if a language generated from a unimodal map is context-free, then it must be regular, i.e. there exists no proper context-free language which can be generated from a unimodal map. T...

متن کامل

Toeplitz transforms of Fibonacci sequences

We introduce a matricial Toeplitz transform and prove that the Toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. We investigate the injectivity of this transform and show how this distinguishes the Fibonacci sequence among other recurrence sequences. We then obtain new Fibonacci identities as an application of our transform.

متن کامل

A Family of Fibonacci-like Conditional Sequences

Let {ai,j} be real numbers for 0 6 i 6 r 1 and 1 6 j 6 2, and define a sequence {vn} with initial conditions v0, v1 and conditional linear recurrence relation vn = at,1vn 1 + at,2vn 2 where n ⌘ t (mod r) (n > 2). The sequence {vn} can be viewed as a generalization of many well-known integer sequences, such as Fibonacci, Lucas, Pell, Jacobsthal, etc. We find explicitly a linear recurrence equati...

متن کامل

Properties of Periodic Fibonacci-like Sequences

Generalized Fibonacci-like sequences appear in finite difference approximations of the Partial Differential Equations based upon replacing partial differential equations by finite difference equations. This paper studies properties of the generalized Fibonacci-like sequence . It is shown that this sequence is periodic with the period ( ) if | | .

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2005

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2005.02.001